Monotone Decompositions of «continua1
ثبت نشده
چکیده
A 0-continuum (9„-continuum) is a compact, connected, metric space that is not separated into infinitely many (more than n) components by any subcontinuum. The following results are among those proved. The first generalizes earlier joint work with E. J. Vought for ^„-continua, and the second generalizes earlier work by Vought for 6,-continua. A 0-continuum X admits a monotone, upper semicontinuous decomposition <>D such that the elements of ^D have void interiors and the quotient space X/tf) is a finite graph, if and only if, for each nowhere dense subcontinuum H of X, the continuum T(H) = [x e X\ if K is a subcontinuum of X and x is in the interior of K, then K n H =£ 0 } is nowhere dense. Also, if X satisfies this condition, then X is in fact a ^„-continuum, for some natural number n, and, for each natural number m, AT is a (^-continuum, if and only if X/6!) is a 0m-continuum.
منابع مشابه
Circuit Complexity and Decompositions of Global Constraints
We show that tools from circuit complexity can be used to study decompositions of global constraints. In particular, we study decompositions of global constraints into conjunctive normal form with the property that unit propagation on the decomposition enforces the same level of consistency as a specialized propagation algorithm. We prove that a constraint propagator has a a polynomial size dec...
متن کاملA ug 2 00 6 DECOMPOSITIONS OF THE FREE ADDITIVE CONVOLUTION
We introduce and study a new type of convolution of probability measures called the orthogonal convolution, which is related to the monotone convolution. Using this convolution, we derive alternating decompositions of the free additive convolution μ` ν of compactly supported probability measures in free probability. These decompositions are directly related to alternating decompositions of the ...
متن کاملDecompositions of the Free Additive Convolution
We introduce and study a new type of convolution of probability measures called the orthogonal convolution, which is related to the monotone convolution. Using this convolution, we derive alternating decompositions of the free additive convolution μ` ν of compactly supported probability measures in free probability. These decompositions are directly related to alternating decompositions of the ...
متن کاملOn Borwein--Wiersma Decompositions of Monotone Linear Relations
Monotone operators are of basic importance in optimization as they generalize simultaneously subdifferential operators of convex functions and positive semidefinite (not necessarily symmetric) matrices. In 1970, Asplund studied the additive decomposition of a maximal monotone operator as the sum of a subdifferential operator and an “irreducible” monotone operator. In 2007, Borwein and Wiersma [...
متن کاملAlgorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems
A useful approach to the mathematical analysis of large-scale biological networks is based upon their decompositions into monotone dynamical systems. This paper deals with two computational problems associated to finding decompositions which are optimal in an appropriate sense. In graph-theoretic language, the problems can be recast in terms of maximal sign-consistent subgraphs. The theoretical...
متن کامل